Graph Decomposition and Parity
نویسندگان
چکیده
منابع مشابه
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
Ž . We present efficient parallel algorithms for two hierarchical clustering heuristics. We point out that these heuristics can also be applied to solving some algorithmic problems in graphs, including split decomposition. We show that efficient parallel split decomposition induces an efficient parallel parity graph recognition algorithm. This is a consequence of the result of S. Cicerone and D...
متن کاملGraph Structure and Parity Games
We investigate the possible structural changes one can perform on a game graph without destroying the winning regions of the players playing a parity game on it. More precisely, given a game graph (G, p) for which we can efficiently compute winning regions, can we remove or add a vertex or edge or change a single priority and maintain at least part of the winning region? Also, what about restri...
متن کاملtoeplitz graph decomposition
let $n,t_1,...,t_k$ be distinct positive integers. a toeplitz graph $g=(v, e)$ denoted by $t_n$ is a graph, where $v ={1,...,n}$ and $e= {(i,j) : |i-j| in {t_1,...,t_k}}$.in this paper, we present some results on decomposition of toeplitz graphs.
متن کاملParity in graph sharing games
Two players share a connected graph with non-negative weights on the vertices. They alternately take the vertices (one in each turn) and collect their weights. There are two variants of the rule they have to obey: one is that the taken (removed) part of the graph must be connected after each move, the other one is that the remaining part of the graph must be connected after each move. Both play...
متن کاملGraph Searching, Parity Games and Imperfect Information
We investigate the interrelation between graph searching games and games with imperfect information. As key consequence we obtain that parity games with bounded imperfect information can be solved in Ptime on graphs of bounded DAG-width which generalizes several results for parity games on graphs of bounded complexity. We use a new concept of graph searching where several cops try to catch mult...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2015
ISSN: 0364-9024
DOI: 10.1002/jgt.21907